On packing and covering polyhedra in infinite dimensions
نویسندگان
چکیده
We consider the natural generalizations of packing and covering polyhedra in infinite dimensions, and study issues related to duality and integrality of extreme points for these sets. Using appropriate finite truncations we give conditions under which complementary slackness holds for primal/dual pairs of the infinite linear programming problems associated with infinite packing and covering polyhedra. We also give conditions under which the extreme points are integral. We illustrate an application of our results on an infinite-horizon lot-sizing problem.
منابع مشابه
A New Approach to Covering
For finite coverings in euclidean d-space E we introduce a parametric density function. Here the parameter controls the influence of the boundary of the covered region to the density. This definition gives an new approach to covering which is similar to the approach for packing in [BHW]. In this way we obtain a unified theory for finite and infinite covering and generalize similar results for d...
متن کاملOn Blocking and Anti-Blocking Polyhedra in Infinite Dimensions
We consider the natural generalizations of blocking and antiblocking polyhedra in infinite dimensions, and study issues related to duality and integrality of extreme points for these sets. Using appropriate finite truncations we give conditions under which complementary slackness holds for primal-dual pairs of the infinite linear programming problems associated with infinite blocking and anti-b...
متن کاملLower bounds on the lattice-free rank for packing and covering integer programs
In this paper, we present lower bounds on the rank of the split closure, the multi-branch closure and the lattice-free closure for packing sets as a function of the integrality gap. We also provide a similar lower bound on the split rank of covering polyhedra. These results indicate that whenever the integrality gap is high, these classes of cutting planes must necessarily be applied for many r...
متن کاملOn the Relationship between Disjunctive Relaxations and Minors in Packing and Covering Problems
In 2002, Aguilera et al. analyzed the performance of the disjunctive lift-and-project operator defined by Balas, Ceria and Cornuéjols on covering and packing polyhedra, in the context of blocking and antiblocking duality. Their results generalize Lovász’s Perfect Graph Theorem and a theorem of Lehman on ideal clutters. This study motivated many authors to work on the same ideas, providing alter...
متن کاملMatroid intersection, base packing and base covering for infinite matroids
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard theorems of finite matroid theory might extend to the infinite setting. These include base packing, base covering, and matroid intersection and union. We show that several of these conjectures are equivalent, so that each gives a perspective on the same central problem of in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 44 شماره
صفحات -
تاریخ انتشار 2016